(S, S´)-gap Shifts as a Generalization of Run-length-limited Codes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The power spectrum of run-length-limited codes

In this paper, a novel method is developed for computing formulae for the power spectra associated with run-length-limited (RLL) codes. Explicit use is made of a compact description of the run-length process associated with the RLL code. This association simplifies the general derivation of the power spectrum. The calculation of the spectra of several RLL codes popular in data storage applicati...

متن کامل

Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes

We investigate binary sequences which can be obtained by concatenating the columns of (0,1)-matrices derived from permutation sequences. We then prove that these binary sequences are subsets of a surprisingly diverse ensemble of codes, namely the Levenshtein codes, capable of correcting insertion/deletion errors; spectral null codes, with spectral nulls at certain frequencies; as well as being ...

متن کامل

New Capacity-Approaching Codes for Run-Length-Limited Channels

To my parents ACKNOWLEDGEMENTS I have cherished the opportunity to work with Dr. Steven W. McLaughlin. His constant encouragement and enthusiasm have made us all feel comfortable. I am very grateful for his guidance, and wish him and his family the very best in coming years. V. Kuznetsov for several helpful discussions and insights. Other not-so-insightful, but nevertheless entertaining discuss...

متن کامل

Using Nesterov\'s Excessive Gap Method as Basic Procedure in Chubanov\'s Method for Solving a Homogeneous Feasibility Problem

We deal with a recently proposed method of Chubanov [1], for solving linear homogeneous systems with positive variables. We use Nesterov's excessive gap method in the basic procedure. As a result, the iteration bound for the basic procedure is reduced by the factor $nsqrt{n}$. The price for this improvement is that the iterations are more costly, namely $O(n^2 )$ instead of $O(n)$. The overall ...

متن کامل

Construction for obtaining trellis run length limited error control codes from convolutional codes

Recently a new construction of run length limited block error control codes based on control matrices of linear block codes was proposed. In this paper a similar construction for obtaining trellis run length limited error control codes from convolutional codes is described. The main advantage of it, beyond its simplicity is that it does not require any additional redundancy except the one which...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: British Journal of Mathematics & Computer Science

سال: 2014

ISSN: 2231-0851

DOI: 10.9734/bjmcs/2014/11488